Jointly Optimal Routing and Caching for Arbitrary Network Topologies
نویسندگان
چکیده
منابع مشابه
Utility Optimal Scheduling for Coded Caching in General Topologies
We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand performs poorly especially in the regime of a large number of users due to a vanishing multicast rate. We overcome this detrimental effect by a careful design o...
متن کاملOblivious Routing for Sensor Network Topologies
We present oblivious routing algorithms whose routing paths are constructed independent of each other, with no dependence on the routing history. Oblivious algorithms are inherently adaptive to dynamic packet traffic, exhibit low congestion, and require low maintenance. All these attributes make oblivious algorithms to be suitable for sensor networks which are characterized by their limited ene...
متن کاملJointly power and bandwidth allocation for a heterogeneous satellite network
Due to lack of resources such as transmission power and bandwidth in satellite systems, resource allocation problem is a very important challenge. Nowadays, new heterogeneous network includes one or more satellites besides terrestrial infrastructure, so that it is considered that each satellite has multi-beam to increase capacity. This type of structure is suitable for a new generation of commu...
متن کاملFormal Verification of Arbitrary Network Topologies
We show how data independence re sults can be used to generalise an inductive proof from binary to arbitrary branching tree networks The example used is modelled on the RSVP Re source Reservation Protocol Of particular inter est is the need for a separate lower level induction which is itself closely tied to data independence The inductions combine the use of the process alge bra CSP to model s...
متن کاملFormal Veri cation of Arbitrary Network Topologies
We show how data independence results can be used to generalise an inductive proof from binary to arbitrary branching tree networks. The example used is modelled on the RSVP Resource Reservation Protocol. Of particular interest is the need for a separate lower-level induction which is itself closely tied to data independence. The inductions combine the use of the process algebra CSP to model sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2018
ISSN: 0733-8716,1558-0008
DOI: 10.1109/jsac.2018.2844981